蛋白质通过折叠到特定的3D结构来执行生物学功能。为了准确地模拟蛋白质结构，应仔细考虑氨基酸（例如侧链扭转角度和氨基酸际方向）之间的总体几何拓扑和局部细粒关系。在这项工作中，我们提出了定向的体重神经网络，以更好地捕获不同氨基酸之间的几何关系。我们的新框架将单个重量从标量扩大到3D定向矢量，支持经典和SO（3）的丰富几何操作（3） - 表示特征，在其上，我们构建了一个可用于处理氨基酸的感知器单元信息。此外，我们还引入了一条蛋白质上的范式传递范式，以将定向权重的感知器插入现有的图形神经网络中，从而显示出在全球尺度上保持SO（3） - 均衡性方面的较高多功能性。实验表明，与经典的神经网络和（全球）模棱两可的网络相比，我们的网络在表示几何关系方面具有更好的表现力。它还在与蛋白质3D结构有关的各种计算生物学应用上实现最新性能。

Muilti-Delicality数据在生物学中普遍存在，特别是我们进入了多OMICS时代，当我们可以测量来自不同方面（OMIC）的相同生物对象（单元）来提供更全面的洞察蜂窝系统。在处理此类多个OMICS数据时，第一步是确定不同模式之间的对应关系。换句话说，我们应该与与相同对象相对应的不同空格匹配数据。这个问题在单细胞多OMICS场景中特别具有挑战性，因为这种数据具有极高的尺寸。其次，匹配的单细胞多OMICS数据是罕见的且难以收集的。此外，由于实验环境的局限性，数据通常非常嘈杂。为了促进单细胞多OMICS研究，我们克服了上述挑战，提出了一种新颖的框架来对齐和集成单细胞RNA-SEQ数据和单细胞ATAC-SEQ数据。我们的方法可以通过在统一空间中有效地将上述数据与来自不同空间的高稀疏性和噪声从不同空间的噪声映射到低维歧管，使下游对准和直接集成。与其他最先进的方法相比，我们的方法在模拟和实际单细胞数据中执行更好。所提出的方法有助于单细胞多OMICS研究。对模拟数据集成的改进是显着的。

量化城市道路网络（URNS）不同部分的拓扑相似之处使我们能够了解城市成长模式。虽然传统统计信息提供有关单个节点的直接邻居或整个网络的特性的有用信息，但是这种度量无法衡量考虑本地间接邻域关系的子网的相似性。在这项研究中，我们提出了一种基于图的机器学习方法来量化子网的空间均匀性。我们将该方法应用于全球30个城市的11,790个城市道路网络，以衡量每个城市和不同城市的道路网络的空间均匀性。我们发现，城市内的空间均匀性与诸如GDP和人口增长的社会经济地位高度相关。此外，通过在不同城市转移模型获得的城市间空间均匀性揭示了欧洲的城市网络结构的城市网络结构间相似性，传递给美国和亚洲的城市。可以利用使用我们的方法揭示的社会经济发展和城市间相似性，以了解和转移城市的洞察力。它还使我们能够解决城市政策挑战，包括在迅速城市化地区的网络规划，并打击区域不平等。

许多古典童话，小说和剧本都利用对话来推进故事情节并建立角色。我们提出了第一个研究，以探索机器是否可以理解和产生故事中的对话，这需要捕获不同角色的特征及其之间的关系。为此，我们提出了两项​​新任务，包括蒙版对话生成和对话演讲者的认可，即分别产生对话转弯和预测说话者的指定对话转弯。我们构建了一个新的数据集拨号故事，该数据集由105K中国故事组成，其中包含大量对话，以支持评估。我们通过对拨号故事进行自动和手动评估测试现有模型来显示提出的任务的困难。此外，我们建议学习明确的角色表示，以提高这些任务的绩效。广泛的实验和案例研究表明，我们的方法可以产生更连贯和信息丰富的对话，并获得比强基础更高的说话者识别精度。

近几十年来，Camera-IMU（惯性测量单元）传感器融合已经过度研究。已经提出了具有自校准的运动估计的许多可观察性分析和融合方案。然而，它一直不确定是否在一般运动下观察到相机和IMU内在参数。为了回答这个问题，我们首先证明，对于全球快门Camera-IMU系统，所有内在和外在参数都可以观察到未知的地标。鉴于此，滚动快门（RS）相机的时间偏移和读出时间也证明是可观察到的。接下来，为了验证该分析并解决静止期间结构无轨滤波器的漂移问题，我们开发了一种基于关键帧的滑动窗滤波器（KSWF），用于测量和自校准，它适用于单眼RS摄像机或立体声RS摄像机。虽然关键帧概念广泛用于基于视觉的传感器融合，但对于我们的知识，KSWF是支持自我校准的首先。我们的模拟和实际数据测试验证了，可以使用不同运动的机会主义地标的观察来完全校准相机-IMU系统。实际数据测试确认了先前的典故，即保持状态矢量的地标可以弥补静止漂移，并显示基于关键帧的方案是替代治疗方法。

Knowledge graphs (KG) have served as the key component of various natural language processing applications. Commonsense knowledge graphs (CKG) are a special type of KG, where entities and relations are composed of free-form text. However, previous works in KG completion and CKG completion suffer from long-tail relations and newly-added relations which do not have many know triples for training. In light of this, few-shot KG completion (FKGC), which requires the strengths of graph representation learning and few-shot learning, has been proposed to challenge the problem of limited annotated data. In this paper, we comprehensively survey previous attempts on such tasks in the form of a series of methods and applications. Specifically, we first introduce FKGC challenges, commonly used KGs, and CKGs. Then we systematically categorize and summarize existing works in terms of the type of KGs and the methods. Finally, we present applications of FKGC models on prediction tasks in different areas and share our thoughts on future research directions of FKGC.

Unsupervised domain adaptation (UDA) for semantic segmentation is a promising task freeing people from heavy annotation work. However, domain discrepancies in low-level image statistics and high-level contexts compromise the segmentation performance over the target domain. A key idea to tackle this problem is to perform both image-level and feature-level adaptation jointly. Unfortunately, there is a lack of such unified approaches for UDA tasks in the existing literature. This paper proposes a novel UDA pipeline for semantic segmentation that unifies image-level and feature-level adaptation. Concretely, for image-level domain shifts, we propose a global photometric alignment module and a global texture alignment module that align images in the source and target domains in terms of image-level properties. For feature-level domain shifts, we perform global manifold alignment by projecting pixel features from both domains onto the feature manifold of the source domain; and we further regularize category centers in the source domain through a category-oriented triplet loss and perform target domain consistency regularization over augmented target domain images. Experimental results demonstrate that our pipeline significantly outperforms previous methods. In the commonly tested GTA5$\rightarrow$Cityscapes task, our proposed method using Deeplab V3+ as the backbone surpasses previous SOTA by 8%, achieving 58.2% in mIoU.

Given the increasingly intricate forms of partial differential equations (PDEs) in physics and related fields, computationally solving PDEs without analytic solutions inevitably suffers from the trade-off between accuracy and efficiency. Recent advances in neural operators, a kind of mesh-independent neural-network-based PDE solvers, have suggested the dawn of overcoming this challenge. In this emerging direction, Koopman neural operator (KNO) is a representative demonstration and outperforms other state-of-the-art alternatives in terms of accuracy and efficiency. Here we present KoopmanLab, a self-contained and user-friendly PyTorch module of the Koopman neural operator family for solving partial differential equations. Beyond the original version of KNO, we develop multiple new variants of KNO based on different neural network architectures to improve the general applicability of our module. These variants are validated by mesh-independent and long-term prediction experiments implemented on representative PDEs (e.g., the Navier-Stokes equation and the Bateman-Burgers equation) and ERA5 (i.e., one of the largest high-resolution data sets of global-scale climate fields). These demonstrations suggest the potential of KoopmanLab to be considered in diverse applications of partial differential equations.

Different people speak with diverse personalized speaking styles. Although existing one-shot talking head methods have made significant progress in lip sync, natural facial expressions, and stable head motions, they still cannot generate diverse speaking styles in the final talking head videos. To tackle this problem, we propose a one-shot style-controllable talking face generation framework. In a nutshell, we aim to attain a speaking style from an arbitrary reference speaking video and then drive the one-shot portrait to speak with the reference speaking style and another piece of audio. Specifically, we first develop a style encoder to extract dynamic facial motion patterns of a style reference video and then encode them into a style code. Afterward, we introduce a style-controllable decoder to synthesize stylized facial animations from the speech content and style code. In order to integrate the reference speaking style into generated videos, we design a style-aware adaptive transformer, which enables the encoded style code to adjust the weights of the feed-forward layers accordingly. Thanks to the style-aware adaptation mechanism, the reference speaking style can be better embedded into synthesized videos during decoding. Extensive experiments demonstrate that our method is capable of generating talking head videos with diverse speaking styles from only one portrait image and an audio clip while achieving authentic visual effects. Project Page: https://github.com/FuxiVirtualHuman/styletalk.

Transformer has achieved impressive successes for various computer vision tasks. However, most of existing studies require to pretrain the Transformer backbone on a large-scale labeled dataset (e.g., ImageNet) for achieving satisfactory performance, which is usually unavailable for medical images. Additionally, due to the gap between medical and natural images, the improvement generated by the ImageNet pretrained weights significantly degrades while transferring the weights to medical image processing tasks. In this paper, we propose Bootstrap Own Latent of Transformer (BOLT), a self-supervised learning approach specifically for medical image classification with the Transformer backbone. Our BOLT consists of two networks, namely online and target branches, for self-supervised representation learning. Concretely, the online network is trained to predict the target network representation of the same patch embedding tokens with a different perturbation. To maximally excavate the impact of Transformer from limited medical data, we propose an auxiliary difficulty ranking task. The Transformer is enforced to identify which branch (i.e., online/target) is processing the more difficult perturbed tokens. Overall, the Transformer endeavours itself to distill the transformation-invariant features from the perturbed tokens to simultaneously achieve difficulty measurement and maintain the consistency of self-supervised representations. The proposed BOLT is evaluated on three medical image processing tasks, i.e., skin lesion classification, knee fatigue fracture grading and diabetic retinopathy grading. The experimental results validate the superiority of our BOLT for medical image classification, compared to ImageNet pretrained weights and state-of-the-art self-supervised learning approaches.